Verification of PCP-Related Computational Reductions in Coq
نویسندگان
چکیده
We formally verify several computational reductions concerning the Post correspondence problem (PCP) using the proof assistant Coq. Our verifications include a reduction of a string rewriting problem generalising the halting problem for Turingmachines to PCP, and reductions of PCP to the intersection problem and the palindrome problem for context-free grammars. A rigorous correctness proof for the reduction of the halting problem to PCP is missing in the literature.
منابع مشابه
Computational Soundness of Formal Encryption in Coq
We formalize Abadi and Rogaway's computational soundness result in the Coq interactive theorem prover. This requires to model notions of provable cryptography like indistinguishability between ensembles of probability distributions, PPT reductions, and security notions for encryption schemes. Our formalization is the rst computational soundness result to be mechanized, and it shows the feasibil...
متن کاملA metamodeling level transformation from UML sequence diagrams to Coq
Modeling is an important aspect of UML formal verification that directly affects the quality and efficiency of the verification. Formal models are the foundation of formal verification. As UML diagrams only have semi-formal semantics, they cannot be used for formal verification directly. Recent studies present model transformation from semi-formal UML models to formal models to solve the issues...
متن کاملMirrorShard: Proof by Computational Reflection with Verified Hints
We describe a method for building composable and extensible verification procedures within the Coq proof assistant. Unlike traditional methods that rely on run-time generation and checking of proofs, we use verified-correct procedures with Coq soundness proofs. Though they are internalized in Coq’s logic, our provers support sound extension by users with hints over new domains, enabling automat...
متن کاملCardinalities of Finite Relations in Coq with Applications
In this paper we present an extension of a Coq library for relation algebras and related algebraic structures. So far, the library did not provide any tools about the cardinalities of relations. Thus we add an algebraic axiomatisation of cardinalities. Its point-free nature makes it possible to reason about cardinal purely algebraically, which is well-suited for mechanisation. We present severa...
متن کاملNumerical study of the effect of fuel injection timing on the ignition delay, performance parameters and exhaust emission of gas/dual fuel diesel engine using Computational Fluid Dynamics
Today, due to the various usage of compression ignition engines in urban transportation, as well as the need to reduce exhaust emissions and control fuel consumption, the use of alternative fuels has become common in diesel engines. Gaseous fuel is one of the most common alternative fuels that can be used in diesel engines. The utilization of alternative fuels in compression ignition engines re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1711.07023 شماره
صفحات -
تاریخ انتشار 2017